Functional completeness of the mixed λ-calculus and combinatory logic
نویسندگان
چکیده
منابع مشابه
Combinatory Logic and - Calculus for Classical Logic
Since Gri n's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Gri n's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with J (for the elimination rule of falsehood) and P (for Pe...
متن کاملHistory of Lambda-calculus and Combinatory Logic
8 Types 23 8.1 The general development of type theories . . . . . . . . . . . . . . . 23 8.1.1 Types as grammatical categories . . . . . . . . . . . . . . . . 24 8.1.2 Types as sets . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 8.1.3 Types as objects . . . . . . . . . . . . . . . . . . . . . . . . . 26 8.1.4 Types as propositions . . . . . . . . . . . . . . . . . . . . . . 30 8.2 Ear...
متن کاملCompleteness of two systems of illative combinatory logic for first-order propositional and predicate calculus
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus.
متن کاملBinary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-interpreters for these binary languages. Along the way we also present new results on list representations, bracket abstraction, and fixpoint combinators. In the second part we review Algorithmic Information Theory, for whi...
متن کاملFocused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90155-b